Session-based concurrency, declaratively

Abstract Session-based concurrency is a type-based approach to the analysis of message-passing programs. These programs may be specified in an operational or declarative style: former defines how interactions are properly structured; latter governing conditions for correct interactions. In this paper, we study rigorous relationships between and models session-based concurrency. We develop encoding session $$\pi $$ π -calculus processes into linear concurrent constraint calculus ( $$\texttt {lcc}$$ lcc ), model based on partial information (constraints). exploit types ensure that our satisfies precise correctness properties it offers sound basis which requirements can jointly reasoned about. demonstrate applicability results by using specification realistic communication patterns with time contextual information.